package Top200;

/**
 * @author zhangmin
 * @create 2022-02-21 16:07
 * 二分查找
 */
public class searchInsert35 {
    public int searchInsert(int[] nums, int target) {
        int left=0,right=nums.length-1;
        while (left<=right){
            int mid=left+(right-left)/2;
            if (nums[mid]==target) return mid;
            else if (nums[mid]<target){
                left=mid+1;
            }else {
                right=mid-1;
            }
        }
        return left;
    }
}
